On the mathematical synthesis of equational logics
نویسندگان
چکیده
Birkhoff [1935] initiated the general study of algebraic structure. Importantly for our concerns here, his development was from (universal) algebra to (equational) logic. Birkhoff’s starting point was the informal conception of algebra based on familiar concrete examples. Abstracting from these, he introduced the concepts of signature and equational presentation, and thereby formalised what is now our notion of (abstract) algebra. Subsequently he set up the model theory of equational presentations (varieties) and analysed their structure from the standpoint of logical inference for algebraic languages. In doing so, he introduced Equational Logic as a sound and complete deductive system for reasoning about equational assertions in Algebraic Theories. Since Birkhoff’s work, our understanding of algebraic structure has deepened; having been both systematised and extended (see e.g. Lawvere [1963], Ehresmann [1968], Burroni [1981], Kelly and Power [1993], Power [1999]). On the other hand, the development of equational logics has remained ad hoc. The aim of the current work is to fill in this gap. Our standpoint is that equational logics should arise from algebraic structure. In this direction, our first purpose is to provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories (see Part I). Our second purpose is to establish the practicality of the approach. In this respect, we illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff’s Equational Logic and a new equational logic for reasoning about algebraic structure with name-binding operators (see Part II).
منابع مشابه
Mathematical Synthesis of Equational Deduction Systems
Our view of computation is still evolving. The concrete theories for specific computational phenomena that are emerging encompass three aspects: specification and programming languages for describing computations, mathematical structures for modelling computations, and logics for reasoning about properties of computations. To make sense of this complexity, and also to compare and/or relate diff...
متن کاملAlgebraic Meta-Theories and Synthesis of Equational Logics
Fiore and Hur [18] recently introduced a novel methodology—henceforth referred to as Sol—for the Synthesis of equational and rewriting logics from mathematical models. In [18], Sol was successfully applied to rationally reconstruct the traditional equational logic for universal algebra of Birkhoff [3] and its multi-sorted version [26], and also to synthesise a new version of the Nominal Algebra...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملBehavioural reasoning for conditional equations
The behavioral equivalence of hidden terms in an equational specification logic is not itself specifiable in general (Buss and Roşu 2000). But much recent work has been done on its partial specification, in particular using coinduction. In this paper we consider the more general notion of conditional behavioral equivalence introduced by Reichel in 1984. We investigate the behavioral proof theor...
متن کاملCompleteness of Category-Based Equational Deduction
Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 7 شماره
صفحات -
تاریخ انتشار 2010